A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
نویسندگان
چکیده
منابع مشابه
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
Ametaheuristic-based algorithm is presented for the post enrolment-based course timetabling problem used in track-2 of the Second International Timetabling Competition (ITC2007). The featured algorithm operates in three distinct stages – a constructive phase followed by two separate phases of simulated annealing – and is time dependent, due to the fact that various run-time parameters are calcu...
متن کاملScatter Search metaheuristic for Post-Enrolment Course Timetabling Problems: A Review
In this study, the performance of Scatter Search (SS) meta-heuristic for the post-enrolment course timetabling problems reported in recent literature was reviewed. The aim is to address the strengths and limitations of the SS structure and mechanisms; to empower more studies; to investigate the capabilities of SS; and to enhance it for solving timetabling problems as a whole. The SS is almost s...
متن کاملA Modular Multiphase Heuristic Solver for Post Enrolment Course Timetabling
We give a short description of the solver that ranked third in Track Two of the International Timetabling Competition 2007 (ITC2007). It implements a heuristic approach based on stochastic local search and consists of several modules that were found to be useful in different phases of the solution process. Common to all modules is the consideration of only a subset of the constraints that have ...
متن کاملA hybrid genetic algorithm and tabu search approach for post enrolment course timetabling
The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in suitable rooms according to the student enrolment data. The PECTP is an NP-hard combinatorial optimization problem and hence is very difficult to solve to optimality. This paper proposes a hybrid approach to solve ...
متن کاملLocal search and constraint programming for the post enrolment-based course timetabling problem
We present a study of the university post-enrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, constraint programming techniques and hybrids of these in the form of a large neighbourhood search scheme. Our local search approach won the competition. Our best constraint pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2010
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-010-0696-z